|
Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures. He is a professor of computer science at Rutgers University,〔(Faculty listing ), Computer Science, Rutgers, retrieved 2015-07-08.〕 and a co-founder of storage technology startup company Tokutek.〔.〕 Farach-Colton is of Argentine descent, and grew up in South Carolina. While attending medical school, he came out as gay, and met his future husband, with whom he now has twin children.〔.〕 He obtained his Ph.D. in 1991 from the University of Maryland, College Park under the supervision of Amihood Amir. He was program chair of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).〔(14th ACM-SIAM Symposium on Discrete Algorithms ), SIAM, retrieved 2015-07-08.〕 The cache-oblivious B-tree data structures studied by Bender, Demaine, and Farach-Colton beginning in 2000 became the basis for the fractal tree index used by Tokutek's products TokuDB and TokuMX.〔 ==Selected publications== *. *. *. *. *. Previously announced in ICALP 2002. *. Previously announced at FOCS 2000. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Martin Farach-Colton」の詳細全文を読む スポンサード リンク
|